/**
 * @Author @fiber-cloud
 * @Date 2025/8/3 11:34
 * 设计一个循环队列
 */
public class MyCircularQueue {

    private int[] elem;
    public int front;//队头
    public int rear;//队尾


    public MyCircularQueue(int k) {
        elem = new int[k+1];
    }
    //入队列
    public boolean enQueue(int value) {
        if (isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1)% elem.length;
        return true;
    }

    //出队列
    public boolean deQueue() {
        //让队头往后走
        if (isEmpty()){
            return false;
        }
        front = (front + 1)% elem.length;
        return true;
    }

    //获取队头元素
    public int Front() {
        if (isEmpty()){
            return -1;
        }
        return elem[front];
    }


    //获取队尾元素
    public int Rear() {
        if (isEmpty()){
            return -1;
        }
        int index = rear == 0 ? elem.length-1 : rear-1;
        return elem[index];
    }

    public boolean isEmpty() {
        if (rear == front){
            return true;
        }
        return false;
    }

    public boolean isFull() {
        if ((rear + 1)% elem.length  == front){
            return true;
        }
        return false;
    }
}
